Convex subshifts, separated Bratteli diagrams, and ideal structure of tame separated graph algebras
نویسندگان
چکیده
منابع مشابه
Ideal Structure of Graph Algebras
We classify the gauge-invariant ideals in the C∗-algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gauge-invariant primitive ideals in terms of the structural properties of the graph, and describe the K-theory of the C∗-algebras of arbitrary infinite graphs.
متن کاملMinimal Bratteli Diagrams and Dimension Groups of Af C-algebras
A method is described which identifies a wide variety of AF algebra dimension groups with groups of continuous functions. Since the continuous functions in these groups have domains which correspond to the set of all infinite paths in what will be called minimal Bratteli diagrams, it becomes possible, in some cases, to analyze the dimension group’s order preserving automorphisms by utilizing th...
متن کاملNETS AND SEPARATED S-POSETS
Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...
متن کاملGeodesic laminations and Bratteli diagrams of AF C*-algebras
Geodesic laminations is a remarkable abstraction (due to W. P. Thurston) of many otherwise unrelated phenomena occurring in differential geometry, complex analysis and geometric topology. In this article we focus on connections of geodesic laminations with the inductive limits of finite-dimensional semi-simple C-algebras (AF C-algebras). Our main result is a bijection between combinatorial pres...
متن کاملSeparated matchings on colored convex sets
Erdős posed the following problem. Consider an equicolored point set of 2n points, n points red and n points blue, in the plane in convex position. We estimate the minimal number of points on the longest noncrossing path such that edges join points of different color and are straight line segments. The upper bound 4 3 n + O( √ n) is proved [7], [5] and is conjectured to be tight. The best known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2018
ISSN: 0001-8708
DOI: 10.1016/j.aim.2018.01.020